Complexity function - PDFSEARCH.IO - Document Search Engine

Complexity function
Results: 282

#	Item
221	i i Meyers: Encyclopedia of Complexity and Systems Science — Entry 181 — [removed] — 15:43 — page 1 — LE-TEX Drug Design with Artificial Neural Networks Add to Reading List Source URL: www.ivanciuc.org Language: English - Date: 2009-01-18 01:27:40 Science Quantitative structure–activity relationship Artificial neural network Feedforward neural network Artificial neuron Activation function Perceptron Backpropagation Radial basis function network Neural networks Machine learning Cybernetics
222	Theoretical Computer Science[removed] – 324 www.elsevier.com/locate/tcs Entropy as a fixed point Keye Martin∗ Center for High Assurance Computer Systems (Code 5540), Naval Research Laboratory, Washington DC 203 Add to Reading List Source URL: www.nearmidnight.com Language: English - Date: 2012-12-26 17:34:06 Applied mathematics Statistical theory Entropy Randomness Computational complexity theory Inner product space FO Continuous function Mutual information Mathematics Mathematical analysis Information theory
223	The Mathematica® Journal Properties and Generalizations of the Fibonacci Word Fractal Exploring Fractal Curves Add to Reading List Source URL: www.mathematica-journal.com Language: English - Date: 2014-01-15 15:04:49 Combinatorics on words Elementary mathematics Fibonacci word Fractals Sturmian word Complexity function L-system Œ Ø Mathematics Fibonacci numbers Combinatorics
224	Journal of Machine Learning Research[removed]1460 Submitted 5/06; Revised 10/06; Published 7/07 Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions∗ Add to Reading List Source URL: jmlr.org Language: English - Date: 2007-07-10 13:02:43 Computational complexity theory Probabilistic complexity theory Machine learning Cybernetics Probably approximately correct learning Randomized algorithm Time complexity Parity learning One-way function Theoretical computer science Applied mathematics Analysis of algorithms
225	Efficient Private Matching and Set Intersection Michael J. Freedman1? , Kobbi Nissim2?? , and Benny Pinkas3 1 2 Add to Reading List Source URL: www.pinkas.net Language: English - Date: 2004-05-12 12:29:04 Cryptographic protocols Computational complexity theory IP Homomorphic encryption Paillier cryptosystem Communication complexity One-way function Polynomial Oblivious transfer Cryptography Theoretical computer science Applied mathematics
226	The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed] Add to Reading List Source URL: www.cs.unibo.it Language: English - Date: 2007-10-31 03:46:45 Mathematics Theory of computation Blum axioms Computable function ELEMENTARY Recursively enumerable set Smn theorem Computational complexity theory Lambda calculus Theoretical computer science Computability theory Applied mathematics
227	On Asymptotic Notation with Multiple Variables Rodney R. Howell Dept. of Computing and Information Sciences Kansas State University Manhattan, KS[removed]USA Add to Reading List Source URL: people.cis.ksu.edu Language: English - Date: 2008-01-18 11:45:18 Integer sequences Number theory Computational complexity theory Big O notation N1 Factorial Function Summation Analysis of algorithms Mathematics Mathematical notation Combinatorics
228	GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in the context of cl Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-02-15 20:06:55 Mathematics Computer science Computable function Recursive set Computation in the limit Generic-case complexity Turing reduction Halting problem Blum axioms Computability theory Theoretical computer science Theory of computation
229	Order Notation in Practice Roger Orr OR/2 Limited What does complexity measurement mean? Add to Reading List Source URL: accu.org Language: English - Date: 2014-04-14 04:21:09 Analysis of algorithms Mathematical notation Asymptotic analysis Big O notation Structural complexity theory Blum axioms Logarithm HO Function Theoretical computer science Mathematics Computational complexity theory
230	ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS RODNEY G. DOWNEY, CARL G. JOCKUSCH, JR., AND PAUL E. SCHUPP Abstract. We study connections between classical asymptotic density, computability and computable enumerabilit Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2013-07-19 19:14:33 Mathematics Computer science Computable function Recursive set Recursively enumerable set Enumeration Generic-case complexity Halting problem Low Computability theory Theory of computation Theoretical computer science

UPDATE